b68a7ab3a8c7279e21dd42c7311acbf5759f8a60,advanced/src/main/java/org/neo4j/graphalgo/impl/path/ShortestPath.java,ShortestPath,findSinglePath,#Node#Node#,57

Before Change


    public Path findSinglePath( Node start, Node end )
    {
        Collection<Path> paths = internalPaths( start, end, true );
        return IteratorUtil.singleValueOrNull( paths.iterator() );
    }
    
    public Collection<Path> findPathsFromScetch( Node... someNodesAlongTheWay )

After Change


    public Path findSinglePath( Node start, Node end )
    {
        Collection<Path> paths = internalPaths( start, end, true );
        return paths.isEmpty() ? null : paths.iterator().next();
    }
    
    public Collection<Path> findPathsFromScetch( Node... someNodesAlongTheWay )